An Optimized Pseudorandom Generator using Packed Matrices

Most cryptographic services and information security protocols require a dependable source of random data; pseudorandom generators are convenient and efficient for this application working as one of the basic foundation blocks on which to build the required security infrastructure. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security by using word packed matrices and modifying key scheduling and bit extraction schemes. The resulting generator is then successfully compared to world class standards. Key-Words: Pseudorandom Generator, Stream Ciphers, Binary Matrices, Cryptography, Security.